Finite Satisfiability in Infinite-Valued Lukasiewicz Logic
نویسندگان
چکیده
Although it is well-known that every satisfiable formula in Lukasiewicz’ infinite-valued logic L∞ can be satisfied in some finitevalued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L∞, we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case upper bound of Aguzzoli et al.
منابع مشابه
Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete
It is well-known that satisfiability (and hence validity) in the minimal classical modal logic is a PSPACE-complete problem. In this paper we consider the satisfiability and validity problems (here they are not dual, although mutually reducible) for the minimal modal logic over a finite Lukasiewicz chain, and show that they also are PSPACE-complete. This result is also true when adding either t...
متن کاملDecidability of a Description Logic over Infinite-Valued Product Logic
This paper proves that validity and satisfiability of assertions in the Fuzzy Description Logic based on infinite-valued Product Logic with universal and existential quantifiers (which are non-interdefinable) is decidable when we only consider quasi-witnessed interpretations. We prove that this restriction is neither necessary for the validity problem (i.e., the validity of assertions in the Fu...
متن کاملFrom Games to Truth Functions: A Generalization of Giles's Game
Motivated by aspects of reasoning in theories of physics, Robin Giles defined a characterization of infinite valued Lukasiewicz logic in terms of a game that combines Lorenzen-style dialogue rules for logical connectives with a scheme for betting on results of dispersive experiments for evaluating atomic propositions. We analyze this game and provide conditions on payoff functions that allow us...
متن کاملOn the Undecidability of Fuzzy Description Logics with GCIs with Lukasiewicz t-norm
Recently there have been some unexpected results concerning Fuzzy Description Logics (FDLs) with General Concept Inclusions (GCIs). They show that, unlike the classical case, the DL ALC with GCIs does not have the finite model property under Lukasiewicz Logic or Product Logic and, specifically, knowledge base satisfiability is an undecidable problem for Product Logic. We complete here the analy...
متن کاملBounded Lukasiewicz Logics
In this work we investigate bounded Lukasiewicz logics, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, . . . , n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus G LBn for each bounded Lukasiewicz logic, obtained by adding a single rule to G L, a hypersequent calcu...
متن کامل